Cryptanalysis on Chen-Qiu-Zheng Blind Signature Scheme
نویسندگان
چکیده
Chen, Qiu, and Zheng proposed a Rabin-like blind signature scheme, which is based on the square-root problem. Although their scheme is simple and efficient, it can be compromised when choosing some particular blinding factors. In this manuscript, the scheme is demonstrated as not being secure.
منابع مشابه
Cryptanalysis of Qiu-Gu-Chen Variant Group Signature Scheme
Qiu et al. proposed a variant group signature scheme in [1]. We find that the group manager can successfully forge signature because he has absolute predominance in Join Phase.
متن کاملCryptanalysis of Two New Signature Schemes
Group signature and blind signature are very important primitives in cryptography. A group signature scheme allows a group member to sign messages anonymously on behalf of the group and a blind signature scheme can ensure anonymity of the sender of a message. Recently, S. Xia and J. You [14] proposed a group signature scheme with strong separability in which the revocation manager can work with...
متن کاملCryptanalysis of Lkk Proxy Signature
A strong proxy signature scheme [7] based on Schnorr’s scheme was proposed by B. Lee et al. in 2001. In this paper we show that in the forementioned scheme, original signer may misuse a proxy signer’s signature of a message M to forge the proxy signer’s normal signature of M .
متن کامل“Untraceability” Analysis of Two ID-Based Proxy Blind Signature from Bilinear Pairings
“Untraceability” is an important property of Proxy blind signature. Zhang proposed some new untraceable blind signatures in order to enhance the security of Cai et al. (2007) and Hu et al. (2007)’s schemes. However, this study shows there are three important conclusions: 1. By reduction, we prove that the cryptanalysis method proposed by Zhang is improper and Cai et al. (2007)’s schemes does sa...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کامل